A data structure for dynamic treesSLEATOR, D. D; TARJAN, R. E.Journal of computer and system sciences (Print). 1983, Vol 26, Num 3, pp 362-391, issn 0022-0000Article

Algorithms and data structurese (Waterloo ON, 15-17 August 2005)Dehne, Frank; Lopez-Ortiz, Alejandro; Sack, Jörg-Rüdiger et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28101-0, XIV, 446 p, isbn 3-540-28101-0Conference Proceedings

Data structure architectures = Architectures de structure de donnéesGILOI, W. K; HEGER, D.RT. Regelungstechnik. 1985, Vol 33, Num 1, pp 25-31, issn 0340-434XArticle

Log-logarithmic worst-case range queries are possible in space Θ (N)WILLARD, D. E.Information processing letters. 1983, Vol 17, Num 2, pp 81-84, issn 0020-0190Article

Efficient data structures for deduction systemsOHLBACH, H. J.Lecture notes in computer science. 1997, Vol 1341, pp 1-2, issn 0302-9743, isbn 3-540-63792-3Conference Paper

Interpolation-based index maintenanceBURKHARD, W. A.BIT (Nordisk Tidskrift for Informationsbehandling). 1983, Vol 23, Num 3, pp 274-294, issn 0006-3835Article

A paradigm for the design of parallel algorithms with applicationsRAMAKRISHNAN, I. V; BROWNE, J. P.IEEE transactions on software engineering. 1983, Vol 9, Num 4, pp 411-415, issn 0098-5589Article

WADS 2003 : algorithms and data structures (Ottawa ON, 30 July - 1 August 2003)Dehne, Frank; Sack, Jörg-Rüdiger; Smid, Michiel et al.Lecture notes in computer science. 2003, issn 0302-9743, isbn 3-540-40545-3, XII, 522 p, isbn 3-540-40545-3Conference Proceedings

Circular programs and self-referential structuresALLISON, L.Software, practice & experience. 1989, Vol 19, Num 2, pp 99-109, issn 0038-0644Article

Constraint relation implementation for finite element analysis from an element basisSAN-CHENG CHANG; TSUNG-WU LIN.Advances in engineering software (1978). 1988, Vol 10, Num 4, pp 191-194, issn 0141-1195Article

Collection-oriented languagesSIPELSTEIN, J. M; BLELLOCH, G. E.Proceedings of the IEEE. 1991, Vol 79, Num 4, pp 504-523, issn 0018-9219, 20 p.Article

Neuron selection for RBF neural network classifier based on data structure preserving criterionMAO, K. Z; HUANG, Guang-Bin.IEEE transactions on neural networks. 2005, Vol 16, Num 6, pp 1531-1540, issn 1045-9227, 10 p.Article

A balanced hierarchical data structure for multidimensional data with highly efficient dynamic characteristicsNAKAMURA, Y; ABE, S; OHSAWA, Y et al.IEEE transactions on knowledge and data engineering. 1993, Vol 5, Num 4, pp 682-694, issn 1041-4347Article

Efficient boolean manipulation with OBDD's can be extended to FBDD'sGERGOV, J; MEINEL, C.IEEE transactions on computers. 1994, Vol 43, Num 10, pp 1197-1209, issn 0018-9340Article

Isotropic vector matrix grid and face-centered cubic lattice data structuresNYSTROM, J. F; BELLOMO, Carryn.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-26032-3, 3Vol, part III, 1096-1099Conference Paper

Efficient state updates for Key managementPINKAS, Benny.Lecture notes in computer science. 2002, pp 40-56, issn 0302-9743, isbn 3-540-43677-4Conference Paper

Lossy dictionariesPAGH, Rasmus; RODLER, Flemming Friche.Lecture notes in computer science. 2001, pp 300-311, issn 0302-9743, isbn 3-540-42493-8Conference Paper

Parlists - A generalization of powerlistsKORNERUP, J.Lecture notes in computer science. 1997, pp 614-618, issn 0302-9743, isbn 3-540-63440-1Conference Paper

Which extended Goppa codes are cyclic?STICHTENOTH, H.Journal of combinatorial theory. Series A. 1989, Vol 51, Num 2, pp 205-220, issn 0097-3165Article

Amortized computational complexityTARJAN, R. E.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 2, pp 306-318, issn 0196-5212Article

Systèmes d'information: les structures physiques de stockage. IVTRICOT, J.L' Informatique professionnelle. 1985, Num 29, pp 57-68, issn 0750-1080Article

A generalized non-recursive binary tree traversalalgorithmHATTER, D. J.Computer journal (Print). 1984, Vol 27, Num 2, pp 178-179, issn 0010-4620Article

Maintaining order in a generalized linked listTSAKALIDIS, A. K.Acta informatica. 1984, Vol 21, Num 1, pp 101-112, issn 0001-5903Article

Non-partitionable point setsAVIS, D.Information processing letters. 1984, Vol 19, Num 3, pp 125-129, issn 0020-0190Article

On the optimal nesting order for computing N-relational joinsIBARAKI, T; KAMEDA, T.ACM transactions on database systems. 1984, Vol 9, Num 3, pp 482-502, issn 0362-5915Article